A Comparison of Different Message - Passing Paradigms
نویسندگان
چکیده
We present experimental results for parallelizing two breadth-rst search-based applications on Thinking Machine's CM-5 by using two diierent message-passing paradigms, one based on send/receive and the other based on active messages. The parallelization of these applications requires ne-grained communication. Our results show that the active messages-based implementation gives signiicant improvement over the send/receive-based implementation. The improvements can largely be attributed to the lower latency of the active messages implementation .
منابع مشابه
Comparing the OpenMP, MPI, and Hybrid Programming Paradigms on an SMP Cluster
Clusters of SMP (Symmetric Multi-Processors) nodes provide support for a wide range of parallel programming paradigms. The shared address space within each node is suitable for OpenMP parallelization. Message passing can be employed within and across the nodes of a cluster. Multiple levels of parallelism can be achieved by combining message passing and OpenMP parallelization. Which programming ...
متن کاملComparing the OpenMP, MPI, and Hybrid Programming Paradigm on an SMP Cluster
Clusters of SMP (Symmetric Multi-Processors) nodes provide support for a wide range of parallel programming paradigms. The shared address space within each node is suitable for OpenMP parallelization. Message passing can be employed within and across the nodes of a cluster. Multiple levels of parallelism can be achieved by combining message passing and OpenMP parallelization. Which programming ...
متن کاملComparing the OpenMP, MPJ, and Hybrid Programming Paradigm on an SMP Cluster
Clusters of SMP (Symmetric Multi-Processors) nodes provide support for a wide range of parallel programming paradigms. The shared address space within each node is suitable for OpenMP parallelization. Message passing can be employed within and across the nodes of a cluster. Multiple levels of parallelism can be achieved by combining message passing and OpenMP parallelization. Which programming ...
متن کاملProgramming a Workstation Cluster with PVM and Linda: a Qualitative and Quantitative Comparison
In this paper a comparison between two of the most signiicant and common tools for distributed computing, PVM and Linda, is carried out. These tools may be used to program a cluster of workstations as well as several commercial multiprocessors and multicomputers and are based upon two completely diierent computational paradigms: message-passing (PVM) and the shared tuple space (Linda). The pape...
متن کامل